skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Zhang, Ruixiang"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Inventiones mathematicae)
    Free, publicly-accessible full text available November 1, 2025
  2. ; ; ; ; ; ; ; (, Discrete analysis)
    Free, publicly-accessible full text available December 23, 2025
  3. ; ; ; ; (, Peking Mathematical Journal)
    Full Text Available 
  4. ; ; ; (, AMS)
    Accepted Manuscript Full Text Available
  5. ; ; ; (, Duke Mathematical Journal)
    Full Text Available 
  6. ; ; (, Transactions of the American Mathematical Society)
    Full Text Available 
  7. ; ; ; ; ; (, International Mathematics Research Notices)
    Abstract We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert’s Irreducibility Theorem for degree $$n$$ polynomials $$f$$ with $$\textrm {Gal}(f) \subseteq A_n$$. We study this both for monic polynomials and non-monic polynomials. Second, we study lower bounds on the number of degree $$n$$ monic polynomials with almost prime discriminants, as well as the closely related problem of lower bounds on the number of degree $$n$$ number fields with almost prime discriminants. 
    more » « less
    Full Text Available 
  8. ; ; ; ; (, Mathematische Annalen)
    null (Ed.)
    Full Text Available 
  9. ; ; ; ; ; (, American Journal of Mathematics)
    Full Text Available 
  10. ; (, Annals of mathematics)
    Accepted Manuscript Full Text Available